A fast block low-rank dense solver with applications to finite-element matrices

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Block Low-Rank Dense Solver with Applications to Finite-Element Matrices

1. Abstract. This article presents a fast dense solver for hierarchically off-diagonal low-rank (HODLR) matrices. This solver uses algebraic techniques such as the adaptive cross approximation (ACA) algorithm to construct the low-rank approximation of the off-diagonal matrix blocks. This allows us to apply the solver to any dense matrix that has an off-diagonal low-rank structure without any pr...

متن کامل

A Fast and Memory Efficient Sparse Solver with Applications to Finite-Element Matrices

In this article we introduce a fast iterative solver for sparse matrices arising from the finite element discretization of elliptic PDEs. The solver uses a fast direct multi-frontal solver as a preconditioner to a simple fixed point iterative scheme. This approach combines the advantages of direct and iterative schemes to arrive at a fast, robust and accurate solver. We will show that this solv...

متن کامل

A Fast Augmented Lagrangian Algorithm for Learning Low-Rank Matrices

We propose a general and efficient algorithm for learning low-rank matrices. The proposed algorithm converges super-linearly and can keep the matrix to be learned in a compact factorized representation without the need of specifying the rank beforehand. Moreover, we show that the framework can be easily generalized to the problem of learning multiple matrices and general spectral regularization...

متن کامل

A Fast Incremental Algorithm for Low Rank Approximations of Matrices and Its Applications in Facial Images

This paper presents a fast incremental algorithm for low rank approximations or dimensionality reduction of matrices. Assuming that matrices have double-sided type of decomposition, we can set up an incremental solution that constitutes two coupled eigenmodels and thus a two-step updating procedure. At each step, we first represent row-row or column-column covariance matrix as the form of eigen...

متن کامل

A Parallel Fast Direct Solver with Applications

The eeectiveness and applicability of a parallel fast direct O(N log N) solver for linear systems with block tridiagonal separable coeecient matrices is considered. This solver is applied in the solution of subsonic full potential ows using the Newton linearization and an algebraic ctitious domain method. The time{harmonic electromagnetic scattering by an obstacle is modeled by the Helmholtz eq...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational Physics

سال: 2016

ISSN: 0021-9991

DOI: 10.1016/j.jcp.2015.10.012